Efficient Identity Based Signature Schemes Based on Pairings
نویسنده
چکیده
We develop an eecient identity based signature scheme based on pairings whose security relies on the hardness of the Diie-Hellman problem in the random oracle model. We describe how this scheme is obtained as a special version of a more general generic scheme which yields further new provably secure identity based signature schemes if pairings are used. The generic scheme also includes traditional public key signature schemes. We further discuss issues of key escrow and the distribution of keys to multiple trust authorities. The appendix contains a brief description of the relevant properties of supersingular elliptic curves and the Weil and Tate pairings.
منابع مشابه
Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings
We describe general exponent group signature schemes and show how these naturally give rise to identity based signature schemes if pairings are used. We prove these schemes to be secure in the random oracle model. Furthermore we describe a particular identity based signature scheme which is quite eecient in terms of bandwidth and computing time, and we develop a further scheme which is not deri...
متن کاملA Non-delegatable Identity-based Designated Verifier Signature Scheme without Bilinear Pairings
Up to now, several non-delegatable identity-based (strong) designated verifier signature schemes using bilinear pairings are proposed. In these identity-based (strong) designated verifier signature schemes, bilinear pairings are employed either in signing and verifying steps or only in the verifying step. However, the computation cost of pairings at a security level equivalent to a 128-bit symm...
متن کاملProvably Secure and Efficient Identity-based Signature Scheme Based on Cubic Residues
Many identity based signature (IBS) schemes have been proposed so far. However, most of the schemes are based on bilinear pairings. Only a few IBS schemes are without pairings. Up to now, there still remains a challenge to construct a provably secure and efficient IBS scheme without pairings. In this paper, we propose an efficient IBS scheme based on cubic residues, and we prove that our scheme...
متن کاملAn Identity-Based Multi-Proxy Multi-Signature Scheme Without Bilinear Pairings and its Variants
The notions of identity-based multi-proxy signature, proxy multi-signature and multi-proxy multisignature have been proposed to facilitate public key certificate management of these kinds of signatures by merely employing signer’s identities in place of the public keys and their certificates. In the literature, most identitybased multi-proxy signature, proxy multi-signature and multi-proxy mult...
متن کاملAn efficient identity-based blind signature scheme without bilinear pairings
The blind signature schemes are useful in some applications where the anonymity is a big issue. Examples include the online voting systems and the electronic cash systems. Since the first identity-based blind signature scheme was proposed by Zhang et al., many identity-based blind signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is a...
متن کامل